Clustering in Hypergraphs to Minimize Average Edge Service Time
نویسندگان
چکیده
منابع مشابه
Clustering in Hypergraphs to Minimize Average Edge Service Time
We study the problem of clustering the vertices of a weighted hypergraph such that on average the vertices of each edge can be covered by a small number of clusters. This problem has many applications such as for designing medical tests, clustering files on disk servers, and placing network services on servers. The edges of the hypergraph model groups of items that are likely to be needed toget...
متن کاملGenerating asymptotically optimal broadcasting schedules to minimize average waiting time
The performance of a Video-on-Demand broadcasting scheme is commonly evaluated by the maximum waiting time encountered by the customer before viewing can start. This paper addresses the issue of minimizing the average waiting time. Recently, we proposed Harmonic Block Windows scheduling to specifically minimize the average waiting time for given bandwidth. Here, we present an efficient heuristi...
متن کاملScheduling Parallel DAG Jobs Online to Minimize Average Flow Time
In this work, we study the problem of scheduling parallelizable jobs online with an objective of minimizing average flow time. Each parallel job is modeled as a DAG where each node is a sequential task and each edge represents dependence between tasks. Previous work has focused on a model of parallelizability known as the arbitrary speed-up curves setting where a scalable algorithm is known. Ho...
متن کاملOn-line scheduling to minimize average completion time revisited
We consider the scheduling problem of minimizing the average-weighted completion time on identical parallel machines when jobs are arriving over time. For both the preemptive and the nonpreemptive setting, we show that straightforward extensions of Smith’s ratio rule yield smaller competitive ratios than the previously best-known deterministic on-line algorithms. c © 2003 Elsevier B.V. All righ...
متن کاملEdge search in hypergraphs
Consider an undirected hypergraph H = (X, E) with a probability distribution P on the set E of its hyperedges. We investigate the average case complexity L(H, P) of finding an unknown hyperedge e*e E, chosen according to P, if only tests are allowed that check, whether e* is contained in the induced subhypergraphs H [ Y ] for Y c X, or not. In this note we prove that for hypergraphs with averag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2020
ISSN: 1549-6325,1549-6333
DOI: 10.1145/3386121